Structure theory of flip graphs with applications to Weak Symmetry Breaking
نویسندگان
چکیده
منابع مشابه
Structure theory of flip graphs with applications to Weak Symmetry Breaking
This paper is devoted to advancing the theoretical understanding of the iterated immediate snapshot (IIS) complexity of the Weak Symmetry Breaking task (WSB). Our rather unexpected main theorem states that there exist infinitely many values of n, such that WSB for n processes is solvable by a certain explicitly constructed 3-round IIS protocol. In particular, the minimal number of rounds, which...
متن کاملSymmetry Breaking in Graphs
A labeling of the vertices of a graph G, φ : V (G) → {1, . . . , r}, is said to be r-distinguishing provided no automorphism of the graph preserves all of the vertex labels. The distinguishing number of a graph G, denoted by D(G), is the minimum r such that G has an r-distinguishing labeling. The distinguishing number of the complete graph on t vertices is t. In contrast, we prove (i) given any...
متن کاملSymmetry Breaking in Graceful Graphs
Symmetry in a Constraint Satisfaction Problem (CSP) can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the search algorithm so that search never visits assignments symmetric to those already considered. Two such approaches are SBDS (Symmetry Breaking During Search) and SBDD (Symmetry Breaking by Dominance Detection); m...
متن کاملPhenomenologically Viable Dynamical Electro–Weak Symmetry Breaking
The lack of deviations from the Standard Model at the current level of experimental precision can be explained systematically in suitable models of dynamical electro–weak symmetry breaking. The key ingredient is dynamics which produces a scalar unitarity partner for the Goldstone–Bosons and which leads to a decoupling of effects beyond the Standard Model. A phenomenologically successful left–ri...
متن کاملWeak symmetry breaking and abstract simplex paths
Motivated by questions in theoretical distributed computing, we develop the combinatorial theory of abstract simplex path subdivisions. Our main application is a short and structural proof of a theorem of Castañeda & Rajsbaum. This theorem in turn implies the solvability of the weak symmetry breaking task in the immediate snapshot wait-free model in the case when the number of processes is not ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied and Computational Topology
سال: 2017
ISSN: 2367-1726,2367-1734
DOI: 10.1007/s41468-017-0001-1